Hidden Markov Models Training Using Hybrid Baum Welch - Variable Neighborhood Search Algorithm

نویسندگان

چکیده

Hidden Markov Models (HMM) are used in a wide range of artifificial intelligence applications including speech recognition, computer vision, computational biology and fifinance. Estimating an HMM parameters is often addressed via the Baum-Welch algorithm (BWA), but this tends to convergence local optimum model parameters. Therefore, optimizing remains crucial challenging work. In paper, Variable Neighborhood Search (VNS) combined with (VNS-BWA) proposed. The idea use VNS escape from minima, enable greater exploration search space, enhance learning capability HMMs models. proposed has entire advantage combination mechanism for training no gradient information, BWA that utilizes kind knowledge. performance method validated on real dataset. results show VNS-BWA better fifinding optimal models, enhancing its classifification performance.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A modified Baum-Welch algorithm for hidden Markov models with multiple observation spaces

In this paper, we derive an algorithm similar to the well-known Baum–Welch algorithm for estimating the parameters of a hidden Markov model (HMM). The new algorithm allows the observation PDF of each state to be defined and estimated using a different feature set. We show that estimating parameters in this manner is equivalent to maximizing the likelihood function for the standard parameterizat...

متن کامل

Comparing the Bidirectional Baum-Welch Algorithm and the Baum-Welch Algorithm on Regular Lattice

A profile hidden Markov model (PHMM) is widely used in assigning protein sequences to protein families. In this model, the hidden states only depend on the previous hidden state and observations are independent given hidden states. In other words, in the PHMM, only the information of the left side of a hidden state is considered. However, it makes sense that considering the information of the b...

متن کامل

Generalized Baum-Welch Algorithm and its Implication to a New Extended Baum-Welch Algorithm

This paper describes how we can use the generalized BaumWelch (GBW) algorithm to develop better extended BaumWelch (EBW) algorithms. Based on GBW, we show that the backoff term in the EBW algorithm comes from KL-divergence which is used as a regularization function. This finding allows us to develop a fast EBW algorithm, which can reduce the time of model space discriminative training by half, ...

متن کامل

comparing the bidirectional baum-welch algorithm and the baum-welch algorithm on regular lattice

a profile hidden markov model (phmm) is widely used in assigning protein sequences to protein families. in this model, the hidden states only depend on the previous hidden state and observations are independent given hidden states. in other words, in the phmm, only the information of the left side of a hidden state is considered. however, it makes sense that considering the information of the b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Statistics, Optimization and Information Computing

سال: 2022

ISSN: ['2310-5070', '2311-004X']

DOI: https://doi.org/10.19139/soic-2310-5070-1213